Cohort intelligence with self-adaptive penalty function approach hybridized with colliding bodies optimization algorithm for discrete and mixed variable constrained problems

نویسندگان

چکیده

Abstract Recently, several socio-/bio-inspired algorithms have been proposed for solving a variety of problems. Generally, they perform well when applied unconstrained problems; however, their performance degenerates constrained Several types penalty function approaches so far handling linear and non-linear constraints. Even though the approach is quite easy to understand, precise choice parameter very much important. It may further necessitate significant number preliminary trials. To overcome this limitation, new self-adaptive (SAPF) incorporated into socio-inspired Cohort Intelligence (CI) algorithm. This referred as CI–SAPF. Furthermore, CI–SAPF hybridized with Colliding Bodies Optimization (CBO) algorithm CI–SAPF–CBO The validated by discrete mixed variable problems from truss structure domain, design engineering nonlinear in nature. applicability techniques two real-world applications manufacturing domain. results obtained are promising computationally efficient compared other nature inspired optimization algorithms. A non-parametric Wilcoxon’s rank sum test performed on statistical solutions examine significance CI–SAPF–CBO. In addition, effect pseudo-objective function, violations analyzed discussed along advantages over

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems

Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...

متن کامل

An Adaptive Penalty Approach for Constrained Genetic-Algorithm Optimization

In this paper we describe a new adaptive penalty approach for handling constraints in genetic algorithm optimization problems. The idea is to start with a relatively small penalty coefficient and then increase it or decrease it on demand as the optimization progresses. Empirical results in several engineering design domains demonstrate the merit of the proposed approach.

متن کامل

Constrained Cohort Intelligence using Static and Dynamic Penalty Function Approach for Mechanical Components Design

Most of the metaheuristics can efficiently solve unconstrained problems; however, their performance may degenerate if the constraints are involved. This paper proposes two constraint handling approaches for an emerging metaheuristic of Cohort Intelligence (CI). More specifically CI with static penalty function approach (SCI) and CI with dynamic penalty function approach (DCI) are proposed. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex & Intelligent Systems

سال: 2021

ISSN: ['2198-6053', '2199-4536']

DOI: https://doi.org/10.1007/s40747-021-00283-3